Journal of Beijing University of Posts and Telecommunications

  • EI核心期刊

JOURNAL OF BEIJING UNIVERSITY OF POSTS AND TELECOM ›› 2008, Vol. 31 ›› Issue (6): 67-70.doi: 10.13190/jbupt.200806.67.199

• Reports • Previous Articles     Next Articles

Adaptive Genetic Algorithm and Its Application in Multi-lateral Multi-issue Negotiation

LI Jian1,2, JING Bo2, YANG Yi-xian1   

  1. (1. National Engineering Laboratory for Disaster Backup and Recovery, Beijing University of Posts and Telecommunications, Beijing 100876, China; 2. School of Software, Beijing Institute of Technology, Beijing 100876, China)
  • Received:2008-06-16 Revised:2008-09-28 Online:2008-12-31 Published:2008-12-31
  • Contact: LI Jian

Abstract:

To make the negotiation agents gain optimal result and more efficiently to negotiate in multi-agent based e-commerce, an adaptive genetic algorithm is presented and applied in multi-lateral multi-issue simultaneous bidding negotiations. 1000 times of experiments show that, for satisfying results, the adaptive genetic algorithm averagely needs 210 times run with contrast to 187 times run of the standard genetic algorithm. So it also shows that the adaptive genetic algorithm can gain the optimal negotiation result more efficiently in multi-literal multi-issue negotiation.

Key words: e-commerce, multi-literal multi-issue negotiation, adaptive genetic algorithm.

CLC Number: